ON THE GLOBAL ROOT NUMBERS OF GL(n)× GL(m)

نویسندگان

  • DIPENDRA PRASAD
  • DINAKAR RAMAKRISHNAN
  • G. Shimura
چکیده

which converges absolutely in R(s) > 1. One knows by Jacquet, Piatetski-Shapiro and Shalika ([JPSS]), and Shahidi ([Sh1]), that this L-function extends to a meromorphic function on all of C and admits a functional equation L(s, π × π) = W (π × π)(N(π × π)dF ) 1 2 L(1− s, π × π ∨ ). Here π (resp. π ∨ ) denotes the contragredient of π (resp. π), dF the discriminant of F , and N(π × π) a positive rational number (“the conductor”). The arithmetically important global root numberW (π×π) is non-zero and satisfies W (π × π)W (π × π ∨ ) = 1. We will be particularly interested in the self-dual situation, when W (π × π) = ±1. It is of importance to determine the sign. Our object here is to make some modest progress on this question.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence analysis of the global FOM and GMRES methods for solving matrix equations $AXB=C$ with SPD coefficients

In this paper‎, ‎we study convergence behavior of the global FOM (Gl-FOM) and global GMRES (Gl-GMRES) methods for solving the matrix equation $AXB=C$ where $A$ and $B$ are symmetric positive definite (SPD)‎. ‎We present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎In particular‎, ‎the obtained upper...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Quadratic Reciprocity for Root Numbers of Gl(2)

Let F be a local/global field. Let E and K be quadratic semisimple F–algebras. Let φ and λ be characters/grössencharacters of E× and K×. We define a local/global symbol ( φ λ ) to be essentially the root number of the representation BCK/F (AIE/F (φ))⊗ λ−1. In the spirit of quadratic reciprocity, we prove that ( φ λ )( λ φ ) = φ(−1)λ(−1). We then derive some consequences of this reciprocity for ...

متن کامل

Theoretical results on the global GMRES method for solving generalized Sylvester matrix‎ ‎equations

‎The global generalized minimum residual (Gl-GMRES)‎ ‎method is examined for solving the generalized Sylvester matrix equation‎ ‎[sumlimits_{i = 1}^q {A_i } XB_i = C.]‎ ‎Some new theoretical results are elaborated for‎ ‎the proposed method by employing the Schur complement‎. ‎These results can be exploited to establish new convergence properties‎ ‎of the Gl-GMRES method for solving genera...

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007